Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
271	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory
272	Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:04:12 NP-complete problems Parameterized complexity Kernelization Path decomposition Clique Tree decomposition Vertex cover Dominating set Edge coloring Graph theory Theoretical computer science Mathematics
273	Subexponential Algorithms for Unique Games and Related problems Sanjeev Arora∗ Boaz Barak† Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2011-10-10 23:52:57 NP-complete problems Graph coloring Vertex cover Graph isomorphism problem Matching Graph operations Cycle rank Graph theory Theoretical computer science Mathematics
274	Distributed Computing FS 2013 Prof. R. Wattenhofer Michael K¨onig Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Mathematics NP-complete problems Hamiltonian path Connectivity Distributed hash table Graph theory Theoretical computer science Distributed data storage
275	Computing Full Disjunctions∗ (Extended Abstract) Yaron Kanza Yehoshua Sagiv Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-07-05 10:44:30 Combinatorial optimization Matching Tree Graph factorization Graph coloring NP-complete problems Computational problems Edge coloring Graph theory Theoretical computer science Mathematics
276	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:26 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
277	ICS 260 – Fall 2001 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:38 Complexity classes NP-complete problems Mathematical optimization Operations research Travelling salesman problem NP Induced path Independent set Directed acyclic graph Theoretical computer science Graph theory Computational complexity theory
278	An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACT Add to Reading List Source URL: xmailserver.org Language: English - Date: 2007-02-16 03:04:45 Operations research NP-complete problems Dynamic programming Equations Systems engineering Shortest path problem Longest common subsequence problem Graph Catalan number Mathematics Theoretical computer science Graph theory
279	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 1, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:15:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Feedback vertex set Graph coloring Vertex cover Dominating set Time complexity Theoretical computer science Computational complexity theory Applied mathematics
280	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Open Problems from CCCG 2005 Erik D. Demaine∗ The following is a list of the problems presented on Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:54 Discrete geometry Euclidean plane geometry Computational geometry NP-complete problems K-set 3SUM Pseudotriangle Planar graph Dominating set Graph theory Mathematics Geometry

UPDATE